#include<bits/stdc++.h>
using namespace std;
int n;
int q[100005];
int num[100005];

int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>num[i];
    }
    sort(num+1,num+n+1);
    int tail=0,head=1;
    q[++tail]=num[1];
    for(int i=2;i<=n;i++){
        if(num[i]>q[head]){
            head++;
        }
        q[++tail]=num[i];

    }

    cout<<tail-head+1;
    return 0;
}
